Temporal query processing with indefinite information

نویسنده

  • Peter van Beek
چکیده

Time is an important aspect of information in medical domains In this paper we adopt Allen s in uential interval algebra framework for representing temporal information The interval algebra allows the repre sentation of inde nite and incomplete information which is necessary in many applications However answering interesting queries in this frame work has been shown to be almost assuredly intractable We show that when the representation language is su ciently restricted we can develop e cient algorithms for answering interesting classes of queries including i determining whether a formula involving temporal relations between events is possibly true and necessarily true and ii answering aggregation questions where the set of all events that satisfy a formula are retrieved We also show by examining applications of the interval algebra discussed in the literature that our restriction on the representation language often is not overly restrictive in practice

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Indefinite Constraint Databases with Temporal Information: Representational Power and Computational Complexity

We develop the scheme of indefinite constraint databases using first-order logic as our representation language. When this scheme is instantiated with temporal constraints, the resulting formalism is more expressive than standard temporal constraint networks. The extra representational power allows us to express temporal knowledge and queries that have been impossible to express before. To make...

متن کامل

Indefinite Information with Certainty Factors for Object-Oriented Databases

This paper presents an approach to integrate the concepts of indefinite information with certainty factor in an object-oriented framework. In this work, the concept of traditional indefinite information is extended to include certainty factors so that indefiniteness can be measured. Indefinite information with certainty factors is classified into two categories: certainty factors of association...

متن کامل

A linear time algorithm for monadic querying of indefinite data over linearly ordered domains

Temporal databases, databases of events in an ordered domain, have attracted attention since the early 90’s, and the complexity of evaluating various queries on such databases has been analyzed [1, 10]. One important issue is an efficient algorithm for a query on an indefinite data over a linearly ordered domain, i.e., efficiently answering a query as to whether all possible models of incomplet...

متن کامل

The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases

In previous work we have developed the scheme of indeenite L-constraint databases where L, the parameter, is a rst-order constraint language. This scheme extends the constraint database proposal of Kanellakis, Kuper and Revesz to include in-deenite (or uncertain) information in the style of Imielinski and Lipski. In this paper we study the complexity of query evaluation in an important instance...

متن کامل

Tractable Query Answering in Indefinite Constraint Databases: Basic Results and Applications to Querying Spatiotemporal Information

We consider the scheme of indeenite constraint databases proposed by Koubarakis. This scheme can be used to represent indefinite information arising in temporal, spatial and truly spatiotemporal applications. The main technical problem that we address in this paper is the discovery of tractable classes of databases and queries in this scheme. We start with the assumption that we have a class of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Artificial Intelligence in Medicine

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1991